-
1 left-to-right parsing
Большой англо-русский и русско-английский словарь > left-to-right parsing
-
2 left-to-right parsing
Вычислительная техника: синтаксический-анализ слева направо -
3 left-to-right parsing
English-Russian dictionary of computer science and programming > left-to-right parsing
-
4 left-right parsing
Большой англо-русский и русско-английский словарь > left-right parsing
-
5 left-right parsing
Математика: синтаксический анализ слева направо -
6 left-right parsing
-
7 left-right parsing
The New English-Russian Dictionary of Radio-electronics > left-right parsing
-
8 left-right parsing
-
9 parsing
parsing синтаксический анализ, синтаксический разбор; грамматический разбор- left-to-right parsing
- precedence parsing
- recursive descent parsing
- shift-reduce parsing
- top-down parsingEnglish-Russian dictionary of computer science and programming > parsing
-
10 parsing
-
11 parsing
The New English-Russian Dictionary of Radio-electronics > parsing
-
12 tree
1) дерево, древо || засаживать деревьями2) древовидная схема; древовидная структура3) т. граф. дерево4) pl дендритные образования на катоде ( при электроосаждении металлов)- mixed star tree - plane tree- set tree
См. также в других словарях:
Parsing — In computer science and linguistics, parsing, or, more formally, syntactic analysis, is the process of analyzing a sequence of tokens to determine their grammatical structure with respect to a given (more or less) formal grammar.Parsing is also… … Wikipedia
Left recursion — In computer science, left recursion is a special case of recursion. In terms of context free grammar, a non terminal r is left recursive if the left most symbol in any of r’s ‘alternatives’ either immediately (direct left recursive) or through… … Wikipedia
Top-down parsing — is a strategy of analyzing unknown data relationships by hypothesizing general parse tree structures and then considering whether the known fundamental structures are compatible with the hypothesis. It occurs in the analysis of both natural… … Wikipedia
Statistical parsing — is a group of parsing methods within natural language processing. The methods have in common that they associate grammar rules with a probability. Grammar rules are traditionally viewed in computational linguistics as defining the valid sentences … Wikipedia
Bottom-up parsing — (also known as shift reduce parsing) is a strategy for analyzing unknown data relationships that attempts to identify the most fundamental units first, and then to infer higher order structures from them. It attempts to build trees upward toward… … Wikipedia
LALR parser — In computer science, a lookahead LR parser or LALR parser is a specialized form of LR parser that can deal with more context free grammars than Simple LR (SLR) parsers. It is a very popular type of parser because it gives a good trade off between … Wikipedia
Text Executive Programming Language — In 1979, Honeywell Information Systems announced a new programming language for their time sharing service named TEX, an acronym for the Text Executive processor. TEX was a first generation scripting language, developed around the time of AWK and … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … Wikipedia
Fluid construction grammar — (FCG) is a construction grammar formalism designed by Luc Steels implementing the notion of emergent grammar and operates from a multi agent perspective (none of the agents will speak the exact same language), useful for studies in evolutionary… … Wikipedia
Operator-precedence parser — An operator precedence parser is a bottom up parser that interprets an operator precedence grammar. For example, most calculators use operator precedence parsers to convert from the human readable infix notation with order of operations format… … Wikipedia